Robust Spectral Clustering via Matrix Aggregation
نویسندگان
چکیده
منابع مشابه
Multi-View Spectral Clustering via Structured Low-Rank Matrix Factorization
Multi-view data clustering attracts more attention than their single view counterparts due to the fact that leveraging multiple independent and complementary information from multi-view feature spaces outperforms the single one. Multi-view Spectral Clustering aims at yielding the data partition agreement over their local manifold structures by seeking eigenvalue-eigenvector decompositions. Amon...
متن کاملRobust path-based spectral clustering
Spectral clustering and path-based clustering are two recently developed clustering approaches that have delivered impressive results in a number of challenging clustering tasks. However, they are not robust enough against noise and outliers in the data. In this paper, based on M-estimation from robust statistics, we develop a robust path-based spectral clustering method by defining a robust pa...
متن کاملScore Aggregation via Spectral Method
The score aggregation problem is to find an aggregate scoring over all candidates given individual scores provided by different agents. This is a fundamental problem with a broad range of applications in social choice and many other areas. The simple and commonly used method is to sum up all scores of each candidate, which is called the sumup method. In this paper, we give good algebraic and ge...
متن کاملNetwork clustering via spectral projections
This paper proposes a novel non-parametric technique for clustering networks based on their structure. Many topological measures have been introduced in the literature to characterize topological properties of networks. These measures provide meaningful information about the structural properties of a network, but many networks share similar values of a given measure [1]. Furthermore, strong co...
متن کاملSpectral Clustering for Robust Motion Segmentation
In this paper, we propose a robust motion segmentation method based on the matrix factorization and subspace separation. We, first, mathematically prove that the shape interaction matrix can be derived using QR decomposition rather than Singular Value Decomposition(SVD). Using shape interaction matrix, we solve the motion segmentation problem using spectral graph clustering technique. We exploi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2871030